A class of balanced binary sequences with optimal autocorrelation properties

نویسندگان

  • Abraham Lempel
  • Martin Cohn
  • Willard L. Eastman
چکیده

From (15) and (II), it follows that because N(0) = IV(O). The resulting estimate of X(w) is given by m bee (2211 c J(Wi-w/&(w) = J(w-Wk), k = 1,. .. ,m. (16) i=l With Aik the elements of the inverse of a matrix whose elements X(w) = X(w) + &) [N(w)-iv(O) +$q equal d(wi-wk), the system (16) yields and the mean-square error by [see (21)] m @i(w) = C A;J(w-wk). k=l (17) From (16), it follows that Without the correction, the mean-square value of the error is @'.i(Wk) = 1, k=i o > k # i. (18) Inserting (17) into (9), we conclude that the optimum estimator N(w) is given by m N(W) = kgl BkJ(w-Wk) (19) where the random variables & are linearly dependent on the data Wi. Setting w = wi in (19), we obtain the system fJ BkJ(wi-Wk) = A(Ui) = Wi, k=l i = 1, fee ,m. (20) The last equality follows from (9) and (18). Thus N(w) is a linear combination of the functions J(w-Wk) and it interpolates N(W) at the zero-crossings wi of Y(w). The coefficients & can be found by solving the system (20). Clearly [see (9) and (ll)], the difference N(w)-R(w) is orthogonal to N(w), hence the mean-square error e is given by e = E(I N(w)-AVOW) = E([iV(w)-N(w)]iV*(w)]. The above yields e = J(0)-f %pi(W)J(Wi-W). i=l (21) The error is zero at w = wi [see (18)]. With N(w) so corrected, the best estimate of X(w) takes the form S(w) = j& [W(w)-mJd1 = X(w) + & [iv(w)-AYW,]. The correction has the following time-domain interpretation: Since the inverse of J(w) equals Z(t), it follows from (19) that the inverse a(t) of the estimator R(w) is given by m fi(t) = z(t) c &ej " 'kt. k=l (2% Thus, to improve the estimation of x (t) with the above method, we deconvolve not the data w(t), but the difference w(t)-a(t). Example: We wish to deconvolve the function w(t) = x(t) * y(t) + n(t), where y(t) is a known function whose transform Y(w) has a single zero at w = 0. We assume that w(t) vanishes for ] t ] > T and that n(t) is stationary white noise with R(t1,tz) = LWl-t'd, It11 < T, ltzl < 7'. Clearly, Z(t) equals Z, for (t ] < T and is 0 otherwise. Hence, J(w) = Z,s_TT e-jut & = 2z0 'r wT. …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A class of pseudonoise sequences over GF(P) with low correlation zone

b = 1. The index set I must be of the form I = A [ B [ C where A = f1g B = fz + 1 j z 2 C0; z + 1 2 C0g and C = f0z j z 2 C1; z + 1 2 C1g: Observe that these three sets are pairwise-disjoint. Therefore, The other cases can be treated similarly. ACKNOWLEDGMENT The authors wish to thank the anonymous referee for careful review of the original manuscript and helpful comments. Double-check of the c...

متن کامل

New families of binary sequences with optimal three-level autocorrelation

In this correspondence we give several new families of binary sequences of period with optimal three-level autocorrelation, where 2(mod 4). These sequences are either balanced or almost balanced. Our construction is based on cyclotomy.

متن کامل

The Linear Complexity of a Class of Binary Sequences With Optimal Autocorrelation

Binary sequences with optimal autocorrelation and large linear complexity have important applications in cryptography and communications. Very recently, a class of binary sequences of period 4p with optimal autocorrelation was proposed by interleaving four suitable Ding-Helleseth-Lam sequences (Des. Codes Cryptogr., DOI 10.1007/s10623-017-0398-5), where p is an odd prime with p ≡ 1( mod 4). The...

متن کامل

Spreading Sequences Generated Using Asymmetrical Integer-Number Maps

Chaotic sequences produced by piecewise linear maps can be transformed to binary sequences. The binary sequences are optimal for the asynchronous DS/CDMA systems in case of certain shapes of the maps. This paper is devoted to the one-to-one integer-number maps derived from the suitable asymmetrical piecewise linear maps. Such maps give periodic integer-number sequences, which can be transformed...

متن کامل

New Optimal Binary Sequences with Period $4p$ via Interleaving Ding-Helleseth-Lam Sequences

Binary sequences with optimal autocorrelation play important roles in radar, communication, and cryptography. Finding new binary sequences with optimal autocorrelation has been an interesting research topic in sequence design. Ding-Helleseth-Lam sequences are such a class of binary sequences of period p, where p is an odd prime with p ≡ 1(mod 4). The objective of this letter is to present a con...

متن کامل

New construction for families of binary sequences with optimal correlation properties

In this correspondence, we present a construction, in a closed form, for an optimal family of 2m binary sequences of period 2 1 with respect to Welch’s bound, whenever there exists a balanced binary sequence of period 2m 1 with ideal autocorrelation property using the trace function. This construction enables us to reinterpret a small set of Kasami and No sequences as a family constructed from ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 24  شماره 

صفحات  -

تاریخ انتشار 1977